A triangle free graph which cannot be 3 imbedded in any euclidean unit sphere

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3-bounded Property in a Triangle-free Distance-regular Graph

Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and D ≥ 3. Assume the intersection numbers a1 = 0 and a2 6= 0. We show Γ is 3-bounded in the sense of the article [D-bounded distance-regular graphs, European Journal of Combinatorics(1997)18, 211-229].

متن کامل

Triangle-free Partitions of Euclidean Space

The instance of this theorem when n = 2 was proved by Ceder [1]. Komjath [4] extended Ceder's result to IR, but with the weaker conclusion that no set of the partition contains the vertices of a regular tetrahedron. Subsequently, we extended Komjath's result to arbitrary dimension n in [7], where it was proved that there is a partition of IR" into countably many sets no one of which contains n ...

متن کامل

Linear Weingarten hypersurfaces in a unit sphere

In this paper, by modifying Cheng-Yau$'$s technique to complete hypersurfaces in $S^{n+1}(1)$, we prove a rigidity theorem under the hypothesis of the mean curvature and the normalized scalar curvature being linearly related which improve the result of [H. Li, Hypersurfaces with constant scalar curvature in space forms, {em Math. Ann.} {305} (1996), 665--672].  

متن کامل

A Poincaré–type Inequality on the Euclidean Unit Sphere

We consider the second variation for the volume of convex bodies associated with the Lp Minkowski-Firey combination and obtain a Poincaré-type inequality on the Euclidean unit sphere Sn−1 . Mathematics subject classification (2010): 52A20.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1978

ISSN: 0097-3165

DOI: 10.1016/0097-3165(78)90004-3